Global and local optimality conditions in set-valued optimization problems
نویسندگان
چکیده
منابع مشابه
Global and local optimality conditions in set-valued optimization problems
Through the paper, X and Y are normed vector spaces; however, most of the results remain true in the more general setting of locally convex spaces. We denote by X∗ and Y∗ the topological dual spaces of X and Y . We consider a pointed closed convex cone Q ⊂ Y which introduces a partial order on Y by the equivalence y1 ≤Q y2 ⇔ y2 − y1 ∈Q; we also suppose, in general, that Q has nonempty interior....
متن کاملOn -optimality Conditions for Convex Set-valued Optimization Problems
In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...
متن کاملPrederivatives of gamma paraconvex set-valued maps and Pareto optimality conditions for set optimization problems
Prederivatives play an important role in the research of set optimization problems. First, we establish several existence theorems of prederivatives for γ-paraconvex set-valued mappings in Banach spaces with [Formula: see text]. Then, in terms of prederivatives, we establish both necessary and sufficient conditions for the existence of Pareto minimal solution of set optimization problems.
متن کاملOptimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
In this paper, we present a new approach to the study of various efficient solutions of a set-valued equilibrium problem (for short, SEP) through the study of corresponding solutions of a set-valued optimization problem with a geometric constraint (for short, SOP). The solutions under consideration are: efficient solutions, weakly efficient solutions, strongly efficient solutions, and properly ...
متن کاملFirst-order optimality conditions in set-valued optimization
A a set-valued optimization problem minC F (x), x ∈ X0, is considered, where X0 ⊂ X , X and Y are Banach spaces, F : X0 Y is a set-valued function and C ⊂ Y is a closed cone. The solutions of the set-valued problem are defined as pairs (x, y), y ∈ F (x), and are called minimizers. In particular the notions ofw-minimizer (weakly efficient points), p-minimizer (properly efficient points) and i-mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2005
ISSN: 0161-1712,1687-0425
DOI: 10.1155/ijmms.2005.1693